Combinatorial and computational aspects of multiple weighted voting games
نویسندگان
چکیده
Weighted voting games are ubiquitous mathematical models which are used in economics, political science, neuroscience, threshold logic, reliability theory and distributed systems. They model situations where agents with variable voting weight vote in favour of or against a decision. A coalition of agents is winning if and only if the sum of weights of the coalition exceeds or equals a specified quota. We provide a mathematical and computational characterization of multiple weighted voting games which are an extension of weighted voting games1. We analyse the structure of multiple weighted voting games and some of their combinatorial properties especially with respect to dictatorship, veto power, dummy players and Banzhaf indices. An illustrative Mathematica program to compute voting power properties of multiple weighted voting games is also provided.
منابع مشابه
Complexity of some aspects of control and manipulation in weighted voting games
An important aspect of mechanism design in social choice protocols and multiagent systems is to discourage insincere behaviour. Manipulative behaviour has received increased attention since the famous Gibbard-Satterthwaite theorem. We examine the computational complexity of manipulation in weighted voting games which are ubiquitous mathematical models used in economics, political science, neuro...
متن کاملBoolean combinations of weighted voting games
Weighted voting games are a natural and practically important class of simple coalitional games, in which each agent is assigned a numeric weight, and a coalition is deemed to be winning if the sum of weights of agents in that coalition meets some stated threshold. We study a natural generalisation of weighted voting games called Boolean Weighted Voting Games (BWVGs). BWVGs are intended to mode...
متن کاملEnumeration and exact design of weighted voting games
In many multiagent settings, situations arise in which agents must collectively make decisions while not every agent is supposed to have an equal amount of influence in the outcome of such a decision. Weighted voting games are often used to deal with these situations. The amount of influence that an agent has in a weighted voting game can be measured by means of various power indices. This pape...
متن کاملOn the Dimensionality of Voting Games
In a yes/no voting game, a set of voters must determine whether to accept or reject a given alternative. Weighted voting games are a well-studied subclass of yes/no voting games, in which each voter has a weight, and an alternative is accepted if the total weight of its supporters exceeds a certain threshold. Weighted voting games are naturally extended to k-vector weighted voting games, which ...
متن کاملVoting Power in the Council of the European Union under the Nice rules
We provide a new method to compute the Banzhaf power index for weighted voting games as well as weighted double and triple majority games. We calculate the Banzhaf index in an exact way by generating functions, with a signi...cant decrease in the computational complexity. Moreover, the Banzhaf indices are calculated for the decision rules approved in the Nice summit meeting, which will be used ...
متن کامل